Harmonic Mean Labeling on Double Triangular Snakes
نویسنده
چکیده
A graph G= (V,E) with p vertices and q edges is called a Harmonic mean graph if it is possible to label the vertices xV with distinct labels f(x) from 1,2,....,q+1 in such a way that when each edge e=uv is labeled with f(uv)= ( ) ( ) ( ) ( ) (or) ( ) ( ) ( ) ( ) , then the edge labels are distinct. In this case, f is called Harmonic mean labeling of G. In this paper we prove that Double Triangular snake and Alternate Double Triangular snake graphs are Harmonic graphs.
منابع مشابه
Triangular Intuitionistic Fuzzy Triple Bonferroni Harmonic Mean Operators and Application to Multi-attribute Group Decision Making
As an special intuitionistic fuzzy set defined on the real number set, triangular intuitionistic fuzzy number (TIFN) is a fundamental tool for quantifying an ill-known quantity. In order to model the decision maker's overall preference with mandatory requirements, it is necessary to develop some Bonferroni harmonic mean operators for TIFNs which can be used to effectively intergrate the informa...
متن کاملOdd Gracefull Labeling for the Subdivison of Double Triangles Graphs
The aim of this paper is to present some odd graceful graphs. In particular we show that an odd graceful labeling of the all subdivision of double triangular snakes ( 2 k ∆ -snake ). We also prove that the all subdivision of 2 1 m∆ -snake are odd graceful. Finally, we generalize the above two results (the all subdivision of 2 k m∆ -snake are odd graceful).
متن کاملVertex Equitable Labeling of Double Alternate Snake Graphs
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملRevisiting the fear of snakes in children: the role of aposematic signalling
Why humans fear snakes is an old, yet unresolved debate. Its innate origin from evolutionary causes is debated against the powerful influence early experience, culture, media and religion may have on people's aversion to snakes. Here we show that the aversion to snakes in human beings may have been mistaken for an aversion to aposematic signals that are commonly displayed by snakes. A total of ...
متن کامل